Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 32/115

Q: What is the time complexity of balancing parentheses algorithm?
A. O (N)
B. O (N log N)
C. O (M log N)
D. O (N2)
Solution: The time complexity of balancing parentheses algorithm is mathematically found to be O (N).
Q: Which application of stack is used to ensure that the pair of parentheses is properly nested?
A. Balancing symbols
B. Reversing a stack
C. Conversion of an infix to postfix expression
D. Conversion of an infix to prefix expression
Solution: Balancing symbols application ensures that the pair of parentheses are properly nested while reversing stack reverses a stack.
Q: In balancing parentheses algorithm, the string is read from?
A. right to left
B. left to right
C. center to right
D. center to left
Solution: Any string is read by the compiler from left to right and not from right to left.
Q: Which is the most appropriate data structure for applying balancing of symbols algorithm?
A.  stack
B. queue
C. tree
D. graph
Solution: Stack is the most appropriate data structure for balancing symbols algorithm because stack follows LIFO principle (Last In First Out).
Q: Which of the following does the balancing symbols algorithm include?
A. balancing double quotes
B. balancing single quotes
C. balancing operators and brackets
D. balancing parentheses, brackets and braces
Solution: The balancing symbols algorithm using stack only includes balancing parentheses, brackets and braces and not any other symbols.
Q: Which of the following statement is incorrect with respect to balancing symbols algorithm?
A. {[()]}
B. ([ )]
C. {( )}
D. { [ ] }
Solution: ([ )] is incorrect because’)’ occurs before the corresponding ‘]’ is encountered.
Q: What should be done when an opening parentheses is read in a balancing symbols algorithm?
A. push it on to the stack
B.  throw an error
C. ignore the parentheses
D. pop the stack
Solution: When an opening bracket/braces/parentheses is encountered, it is pushed on to the stack. When the corresponding end bracket/braces/parentheses is not found, throw an error.
Q: When the corresponding end bracket/braces/parentheses is not found, what happens?
A. The stack is popped
B. Ignore the parentheses
C. An error is reported
D. It is treated as an exception
Solution: When the corresponding end bracket/braces/parentheses is not found, throw an error since they don’t match.
Q: If the corresponding end bracket/braces/parentheses is encountered, which of the following is done?
A. push it on to the stack
B. pop the stack
C. throw an error
D. treated as an exception
Solution: When the corresponding end bracket/braces/parentheses is encountered, the stack is popped. When an opening bracket/braces/parentheses is encountered, it is pushed on to the stack.
Q: Which of the following statement is invalid with respect to balancing symbols?
A. [(A+B) + (C-D)]
B. [{A+B}-{C-[D+E]}]
C. ((A+B) + (C+D)
D. {(A+B) + [C+D]}
Solution: ((A+B) + (C+D) is invalid because the last close brace is not found in the statement.

You Have Score    /10